package algorithm.leetcode.online.q4addtwonumer;

//You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
//
//Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
//Output: 7 -> 0 -> 8
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
//public class Solution {
//    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
//        // Start typing your Java solution below
//        // DO NOT write main() function
//
//    }
//}
import java.util.ArrayList;
public class AddTwoNumber {
  public static void main(String[] args){

  }
}
